"Pollution Havens" and the Regulation of Multinationals by Multiple Governments

No abstract.

An Efficient Dynamic Programming Algorithm for the Generalized LCS Problem with Multiple Substring Exclusion Constrains

In this paper, we consider a generalized longest common subsequence problem with multiple substring exclusion constrains. For the two input sequences $X$ and $Y$ of lengths $n$ and $m$, and a set of $d$ constrains $P=\{P_1,...,P_d\}$ of total length $r$, the problem is to find a common subsequence $Z$ of $X$ and $Y$ excluding each of constrain string in $P$ as a substring and the length of $Z$ is maximized. The problem was declared to be NP-hard\cite{1}, but we finally found that this is not true. A new dynamic programming solution for this problem is presented in this paper. The correctness of the new algorithm is proved. The time complexity of our algorithm is $O(nmr)$.Comment: arXiv admin note: substantial text overlap with arXiv:1301.718

The rhinoceros totem and Pangu myth : An exploration of the archetype of Pangu

There are theories that the Chinese Pangu myth originated either in Western India, the Central Plains, or the South. As for the ethnicity of the Pangu myth, since it is found in almost every group in China many different peoples believe that the Pangu myth belongs to them. However, only the Miao and Yao language families reflect a seamless connection between the regional and ethnic diversities.Issue title "Chinese Oral Traditions.